منابع مشابه
Separator-Based Sparsification II: Edge and Vertex Connectivity
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe algorithms and data structures for maintaining information about 2and 3-vertex-connectivity, and 3and 4-edge-connectivity in a planar graph in O(n1/2) amortized time per insertion, deletion, or connectivity query. All ...
متن کاملSeparator Based Sparsification. I. Planary Testing and Minimum Spanning Trees
We describe algorithms and data structures for maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We give a fully dynamic planarity testing algorithm that maintains a graph subject to edge insertions and deletions and that allows queries that test whether the graph is currently planar, or whether a potentia...
متن کاملDielectrophoresis (DEP) Based Microfluidic Particle Separator
This report introduces a microfluidic system for manipulation and separation of micron-sized particles based on the combined use of negative dielectrophoresis (DEP) and hydrodynamic forces. A 2-D micro-electrode structure has been constructed on the bottom surface on glass wafer and driven with high-frequency AC voltage to generate dielectrophoretic gates. Depending on the relative strengths of...
متن کاملSymmetry-based design of fragment separator optics
Next-generation high-intensity large acceptance fragment separators require a careful design due to the large high order aberrations induced by the large aperture superconducting magnets needed to collect rare isotopes obtained from a high energy primary heavy-ion beam hitting a target. In this paper we propose a fragment separator layout based on various symmetries that satisfies the baseline ...
متن کاملImproved Sparsification
In previous work we introduced sparsification, a technique that transforms fully dynamic algorithms for sparse graphs into ones that work on any graph, with a logarithmic increase in complexity. In this work we describe an improvement on this technique that avoids the logarithmic overhead. Using our improved sparsification technique, we keep track of the following properties: minimum spanning f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1996
ISSN: 0022-0000
DOI: 10.1006/jcss.1996.0002